Minimizing the complexity of an activity network

When an activity-on-arc (AoA) project network is to be constructed, one typically seeks to minimize the number of dummy arcs. Recent investigations have shown, however, that the computational effort of many network-oriented project management techniques depends strongly on the so-called complexity index ( C l ) of a network. We show other justifications for minimizing the Cl rather than the number of dummy arcs, We also present a polynomial time algorithm for constructing an AoA network with the minimum C1 in the class of all AoA networks having the minimum number of nodes, n," 2 0 C O John Wiley & Sons, Inc.